Search results for "metaheuristic algorithm"
showing 4 items of 4 documents
Hybrid prediction-optimization approaches for maximizing parts density in SLM of Ti6Al4V titanium alloy
2022
AbstractIt is well known that the processing parameters of selective laser melting (SLM) highly influence mechanical and physical properties of the manufactured parts. Also, the energy density is insufficient to detect the process window for producing full dense components. In fact, parts produced with the same energy density but different combinations of parameters may present different properties even under the microstructural viewpoint. In this context, the need to assess the influence of the process parameters and to select the best parameters set able to optimize the final properties of SLM parts has been capturing the attention of both academics and practitioners. In this paper differ…
Hybrid chaotic firefly decision making model for Parkinson’s disease diagnosis
2020
Parkinson’s disease is found as a progressive neurodegenerative condition which affects motor circuit by the loss of up to 70% of dopaminergic neurons. Thus, diagnosing the early stages of incidence is of great importance. In this article, a novel chaos-based stochastic model is proposed by combining the characteristics of chaotic firefly algorithm with Kernel-based Naïve Bayes (KNB) algorithm for diagnosis of Parkinson’s disease at an early stage. The efficiency of the model is tested on a voice measurement dataset that is collected from “UC Irvine Machine Learning Repository.” The dynamics of chaos optimization algorithm will enhance the firefly algorithm by introducing six types of chao…
Handling precedence constraints in scheduling problems by the sequence pair representation
2015
In this paper, we show that sequence pair (SP) representation, primarily applied to the rectangle packing problems appearing in the VLSI industry, can be a solution representation of precedence constrained scheduling. We present three interpretations of sequence pair, which differ in complexity of schedule evaluation and size of a corresponding solution space. For each interpretation we construct an incremental precedence constrained SP neighborhood evaluation algorithm, computing feasibility of each solution in the insert neighborhood in an amortized constant time per examined solution, and prove the connectivity property of the considered neighborhoods. To compare proposed interpretations…
An approximate/exact objective based search technique for solving general scheduling problems
2018
Abstract In this paper, we analyze single machine scheduling problems under the following minimization objectives: the maximum completion time (makespan), the total completion time and the maximum lateness, including fundamental practical aspects, which often occur in industrial or manufacturing reality: release dates, due dates, setup times, precedence constraints, deterioration (aging) of machines, as well as maintenance activities. To solve the problems, we propose an efficient representation of a solution and a fast neighborhood search technique, which calculates an approximation of criterion values in a constant time per solution in a neighborhood. On this basis, a novel approximate/ex…